翻訳と辞書 Words near each other ・ Computer Aid International ・ Computer Aided Surgery (journal) ・ Computer Aided Verification ・ Computer algebra system ・ Computer America ・ Computer analyst ・ Computer and Internet Protocol Address Verifier ・ Computer and Management Institute ・ Computer and network surveillance ・ Computer and Video Games ・ Computer animation ・ Computer Animation and Social Agents ・ Computaris ・ Computation ・ Computation and Neural Systems ・ Computation history ・ Computation in the limit ・ Computation of cyclic redundancy checks ・ Computation of radiowave attenuation in the atmosphere ・ Computation offloading ・ Computation tree ・ Computation tree logic ・ Computational aeroacoustics ・ Computational algebra ・ Computational and Mathematical Organization Theory ・ Computational and Statistical Genetics ・ Computational and Structural Biotechnology Journal ・ Computational and Systems Neuroscience ・ Computational and Theoretical Chemistry ・ Computational archaeology Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Computation history ： ウィキペディア英語版 Computation history In computer science, a computation history is a sequence of steps taken by an abstract machine in the process of computing its result. Computation histories are frequently used in proofs about the capabilities of certain machines, and particularly about the undecidability of various formal languages. Formally, a computation history is a (normally finite) sequence of configurations of a formal automaton. Each configuration fully describes the status of the machine at a particular point. To be valid, certain conditions must hold: * the first configuration must be a valid initial configuration of the automaton and * each transition between adjacent configurations must be valid according to the transition rules of the automaton. In addition, to be complete, a computation history must be finite and * the final configuration must be a valid terminal configuration of the automaton. The definitions of "valid initial configuration", "valid transition", and "valid terminal configuration" vary for different kinds of formal machines. A deterministic automaton has exactly one computation history for a given initial configuration, though the history may be infinite and therefore incomplete. == Finite State Machines == For a finite state machine $M$, a configuration is simply the current state of the machine, together with the remaining input. The first configuration must be the initial state of $M$ and the complete input. A transition from a configuration $(S,I)$ to a configuration $(T,J)$ is allowed if $I=aJ$ for some input symbol $a$ and if $M$ has a transition from $S$ to $T$ on input $a$. The final configuration must have the empty string $\backslash epsilon$ as its remaining input; whether $M$ has accepted or rejected the input depends on whether the final state is an accepting state. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Computation history」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.